SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES
نویسندگان
چکیده
منابع مشابه
Single-Source Dilation-Bounded Minimum Spanning Trees
Given a set S of points in the plane, a geometric network for S is a graph G with vertex set S and straight edges. We consider a broadcasting situation, where one point r ∈ S is a designated source. Given a dilation factor δ, we ask for a geometric network G such that for every point v ∈ S there is a path from r to v in G of length at most δ|rv|, and such that the total edge length is minimized...
متن کاملMinimum Dilation Geometric Spanning Trees
The Minimum Dilation Geometric Spanning Tree Problem (MDGSTP) is N P-hard, which justifies the development of heuristics to it. This paper presents heuristics based on the GRASP metaheuristic paradigm for MDGSTP. The input of this problem is a set of points P = {p1, p2, . . . , pn} in the plane. Let the geometric graph G(P) associated with P be the undirected weighted complete graph of n vertic...
متن کاملDegree-bounded minimum spanning trees
* to be exact, times the weight of a minimum spanning tree (MST). In particular, we present an improved analysis of Chan’s degree-4 MST algorithm [4]. Previous results. Arora [1] and Mitchell [9] presented PTASs for TSP in Euclidean metric, for fixed dimensions. Unfortunately, neither algorithm extends to find degree-3 or degree-4 trees. Recently, Arora and Chang [3] have devised a quasi-polyno...
متن کاملMinimum weight spanning trees with bounded diameter
Let G be a simple graph with non-negative edge weights. Determining a minimum weight spanning tree is a fundamental problem that arises in network design and as a subproblem in many combinatorial optimization problems such as vehicle routing. In some applications, it is necessary to restrict the diameter of the spanning tree and thus one is interested in the problem : Find, in a given weighted ...
متن کاملMatroidal degree-bounded minimum spanning trees
We consider the minimum spanning tree (MST) problem under the restriction that for every vertex v, the edges of the tree that are adjacent to v satisfy a given family of constraints. A famous example thereof is the classical degree-bounded MST problem, where for every vertex v, a simple upper bound on the degree is imposed. Iterative rounding/relaxation algorithms became the tool of choice for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2013
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195913500052